New Ternary Fixed Polarity Linear Kronecker Transforms and Their Comparison with Ternary Reed-muller Transform
نویسندگان
چکیده
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed-Muller transform have also been discussed for the purpose of using their error correcting properties that are useful in circuit testing and verification.
منابع مشابه
Ternary Fixed Polarity Linear Kronecker Transforms and their Comparison with Ternary Reed-muller Transform
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed–Muller t...
متن کاملFast computing of the positive polarity Reed - Muller transform over GF ( 2 ) and GF ( 3 )
The problem of efficient computing of binary and ternary positive (or zero) polarity Reed-Muller (PPRM) transform is important for many areas. The matrices, determining these transforms, are defined recursively or by Kronecker product. Using this fact, we apply the dynamic-programming strategy to develop three algorithms. The first of them is a new version of a previous our algorithm for perfor...
متن کاملGeneration of multi-polarity helix transform over GF(3)
In this article, the new multi-polarity helix transform for ternary logic functions has been introduced. In addition, an extended dual polarity property that had been used to optimize Kronecker and quaternary Fixed-Polarity Reed-Muller (FPRM) expressions has been applied to generate efficiently the multi-polarity helix transform over GF(3). The experimental results for the transform are compare...
متن کاملThe Synthesis of Ternary Functions under Fixed Polarities and Ternary I 2 L Circuits
Uf(a,ß,Y,x): Universal-logic-module for ternary functions, based upon Reed-Muller expansion, i.e. aodulo-algebra expansion Uh(c,n,x): basic Universal-logic-module for ternary function«, based upon modulo-algebra expansion uh(5,n,x) t ® n x F]: column vector whose entries are the 3 values of f(x), arranged in Increasing order of y, n-1 yI x^ 1-0 LgCK)]: coefficient column vector based upon modul...
متن کاملEfficient Calculation of the Reed-muller Form by Means of the Walsh Transform
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This pa...
متن کامل